-
1 pairwise disjoint
Большой англо-русский и русско-английский словарь > pairwise disjoint
-
2 pairwise disjoint
Математика: попарно непересекающийся -
3 pairwise disjoint
-
4 pairwise disjoint cycles
Математика: попарно непересекающиеся циклыУниверсальный англо-русский словарь > pairwise disjoint cycles
-
5 pairwise disjoint sets
Математика: попарно непересекающиеся множестваУниверсальный англо-русский словарь > pairwise disjoint sets
-
6 pairwise disjoint subsets
Математика: попарно не пересекающиеся подмножестваУниверсальный англо-русский словарь > pairwise disjoint subsets
-
7 pairwise
попарно, по двое pairwise comaximal ideals ≈ попарно комаксимальные идеалы pairwise compact spaces ≈ попарно компактные пространства pairwise complete spaces ≈ попарно полные пространства pairwise connected relation ≈ попарно связное отношение pairwise disjoint sets ≈ попарно непересекающиеся множества pairwise disjoint subsets ≈ попарно не пересекающиеся подмножества pairwise independent absolute values ≈ попарно независимые абсолютные значения pairwise independent elements ≈ попарно независимые элементы pairwise independent events ≈ попарно независимые события pairwise independent random variables ≈ попарно независимые случайные величины pairwise independent sets ≈ попарно независимые множества pairwise open cover ≈ попарно открытое покрытие pairwise orthogonal elements ≈ попарно ортогональные элементы pairwise relatively prime ideals ≈ попарно взаимно простые идеалы pairwise relatively prime numbers ≈ попарно взаимно простые числа pairwise relatively primes ≈ попарно относительно простые числа pairwise transitive group ≈ двуточечно транзитивная группа - pairwise choice - pairwise compactness - pairwise difference - pairwise disjoint - pairwise distinguishability - pairwise identification - pairwise independence - pairwise independent - pairwise interaction - pairwise orthogonality - pairwise otrhogonal - pairwise sufficiency - pairwise test - pairwise transitive парный, попарный парами, попарноБольшой англо-русский и русско-английский словарь > pairwise
-
8 disjoint
1) несовместимый; несовместный; дизъюнктный2) матем. непересекающийся3) разделять; расчленять; рассоединять4) не пересекаться; не иметь общих элементов•disjoint [disjunctive] ideal — дизъюнктный идеал
linearly disjoint extensions — линейно свободные расширения, линейно разделенные расширения
mutually disjoint [mutually exclusive] sets — непересекающиеся множества
-
9 попарно непересекающийся
Большой англо-русский и русско-английский словарь > попарно непересекающийся
-
10 events
события aggregate of simple events ≈ множество элементарных событий algebra of states and events ≈ алгебра состояний и событий asymptotically independent events ≈ асимптотически независимые события chain dependent events ≈ зависимые события, образующие цепь continuous interference of events ≈ т. вер. непрерывное вмешательство случая delayed recurrent events ≈ рекуррентные события с задержкой discrete interference of events ≈ т. вер. дискретное вмешательство случая equally likely events ≈ равновероятные [равновозможные] события equally possible events ≈ равновероятные [равновозможные] события events occur at random ≈ явления носят случайный характер expected number of events ≈ ожидаемое число событий interval between events ≈ т. вер. интервал между событиями logically related events ≈ логически связанные события mutually exclusive events ≈ взаимно исключающие события mutually independent events ≈ взаимно независимые события pairwise independent events ≈ попарно независимые события set of elementary events ≈ множество элементарных событий statistically dependent events ≈ статистически зависимые события statistically independent events ≈ статистически независимые события stochastically independent events ≈ стохастически независимые события stream of random events ≈ поток случайных событий symmetrically dependent events ≈ эквивалентные события - algebra of events - antithetic events - at all events - chain of events - chained events - coincident events - combination of events - compatible events - consecutive events - crowd of events - current events - cycling of events - disjoint events - equal events - equiprobable events - equivalent events - exclusive events - exhaustive events - family of events - field of events - flow of events - identical events - implication of events - independence of events - independent events - intersection of events - multiple events - nonindependent events - nonoverlapping events - population of events - product of events - quasiequivalent events - quasiindependent events - recurrent events - repetitive events - semigroup of events - sequence of events - series of events - space of events - sum of events - union of events Результаты events: caught up by ~ находящийся в гуще событий events: caught up by ~ находящийся в гуще событий -
11 element
1) элемент, компонент, деталь, составная часть2) звено; блок; модуль3) устройство, узел4) орган5) датчик, первичный элемент6) элемент, параметр• -
12 ideal
1) идеал, предел совершенства || идеальный2) матем. идеал3) мысленный, нереальный, воображаемый•- absolutely unramified ideal - completely simple ideal - disjunctive ideal - invertible ideal - strongly primary ideal - strongly ramified ideal - zero ideal
См. также в других словарях:
Pairwise — may refer to: * Pairwise deletion * Pairwise disjoint * Pairwise independent * PAIRwise Paper Authorship Integrity Research an open source software to detect plagiarism * Pairwise comparison, the process of comparing two entities to determine… … Wikipedia
Disjoint sets — Two disjoint sets. In mathematics, two sets are said to be disjoint if they have no element in common. For example, {1, 2, 3} and {4, 5, 6} are disjoint sets.[1] Explanation Formally, two sets A and … Wikipedia
Disjoint union — In mathematics, the term disjoint union may refer to one of two different concepts: In set theory, a disjoint union (or discriminated union) is a modified union operation that indexes the elements according to which set they originated in;… … Wikipedia
Almost disjoint sets — In mathematics, two sets are almost disjoint if their intersection is small in some sense. Different definitions of small will therefore result in different definitions of almost disjoint . Definition The most common choice is to take small to… … Wikipedia
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
Set packing — is a classical NP complete problem in computational complexity theory and combinatorics, and was one of Karp s 21 NP complete problems. Suppose we have a finite set S and a list of subsets of S. Then, the set packing problem asks if some k… … Wikipedia
Quantum logic — In mathematical physics and quantum mechanics, quantum logic is a set of rules for reasoning about propositions which takes the principles of quantum theory into account. This research area and its name originated in the 1936 paper by Garrett… … Wikipedia
Axiom of choice — This article is about the mathematical concept. For the band named after it, see Axiom of Choice (band). In mathematics, the axiom of choice, or AC, is an axiom of set theory stating that for every family of nonempty sets there exists a family of … Wikipedia
Covering problem of Rado — The covering problem of Rado is an unsolved problem in geometry concerning covering planar sets by squares. It was formulated in 1928 by Tibor Radó and has been generalized to more general shapes and higher dimensions by Richard Rado. Formulation … Wikipedia
Vitali set — In mathematics, a Vitali set is an elementary example of a set of real numbers that is not Lebesgue measurable. The Vitali theorem is the existence theorem that there are such sets. It is a non constructive result. The naming is for Giuseppe… … Wikipedia
Combinatorial species — In combinatorial mathematics, the theory of combinatorial species is an abstract, systematic method for analysing discrete structures in terms of generating functions. Examples of discrete structures are (finite) graphs, permutations, trees, and… … Wikipedia
